Dynamic Fitness Landscape Analysis
نویسنده
چکیده
Solving optimization problems with time varying objective functions by methods of evolutionary computation can be grounded on the theoretical framework of dynamic fitness landscapes. In this chapter, we define such dynamic fitness landscapes and discuss their properties. To this end, analyzing tools for measuring topological and dynamical landscape properties are studied. Based on these landscape measures we obtain an approach for drawing conclusion regarding characteristic features of a given optimization problem. This may allow to address the question of how difficult the problem is for an evolutionary search, and what type of algorithm is most likely to solve it successfully. The methodology is illustrated using a well–known example, the moving peaks.
منابع مشابه
Analysis of fitness landscape modifications in evolutionary dynamic optimization
In this work, discrete dynamic optimization problems (DOPs) are theoretically analysed according to the modifications produced in the fitness landscape during the optimization process. Using the proposed analysis framework, the following DOPs are analysed: problems generated by the XOR DOP generator, three versions of the dynamic 0–1 knapsack problem, one problem involving evolutionary robots i...
متن کاملDynamic landscape models of coevolutionary games
Players of coevolutionary games may update not only their strategies but also their networks of interaction. Based on interpreting the payoff of players as fitness, dynamic landscape models are proposed. The modeling procedure is carried out for Prisoner's Dilemma (PD) and Snowdrift (SD) games that both use either birth-death (BD) or death-birth (DB) strategy updating. The main focus is on usin...
متن کاملDynamic Fitness Landscapes in Molecular Evolution
We study self-replicating molecules under externally varying conditions. Changing conditions such as temperature variations and/or alterations in the environment’s resource composition lead to both non-constant replication and decay rates of the molecules. In general, therefore, molecular evolution takes place in a dynamic rather than a static fitness landscape. We incorporate dynamic replicati...
متن کاملDynamic selection of evolutionary operators based on online learning and fitness landscape analysis
Self-adaptive mechanisms for the identification of the most suitable variation operator in Evolutionary Algorithms rely almost exclusively on the measurement of the fitness of the offspring, which may not be sufficient to assess the optimality of an operator (e.g., in a landscape with an high degree of neutrality). This paper proposes a novel Adaptive Operator Selection mechanism which uses a s...
متن کاملCharacterising fitness landscapes with fitness-probability cloud and its applications to algorithm configuration
Metaheuristics are approximation optimisation techniques widely applied to solve complex optimisation problems. Since metaheuristics are general algorithmic frameworks, a metaheuristic algorithm can have many variants if different configurations (e.g., choice of search operator, numerical parameters, etc.) are applied. In particular, it is widely acknowledged that finding good algorithm configu...
متن کامل